Sis-based Signatures
نویسندگان
چکیده
Basics We will use the following parameters: • n, the security parameter.
منابع مشابه
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
We propose a linearly homomorphic signature scheme that authenticates vector subspaces of a given ambient space. Our system has several novel properties not found in previous proposals: • It is the first such scheme that authenticates vectors defined over binary fields; previous proposals could only authenticate vectors with large or growing coefficients. • It is the first such scheme based on ...
متن کاملTightly-Secure Signatures from Chameleon Hash Functions
We give a new framework for obtaining signatures with a tight security reduction from standardhardness assumptions. Concretely, we show that any Chameleon Hash function can be transformedinto a (binary) tree-based signature scheme with tight security. The transformation is in the standardmodel, i.e., it does not make use of any random oracle. For specific assumptions (such as RSA,<l...
متن کاملRevisiting CK17 Linearly Homomorphic Ring Signature based on SIS
In SCIS 2017, Choi and Kim introduced the new linearly homomorphic ring signature scheme (CK17 scheme) based on the hardness of SIS problem, which overcomes the limitation of Boneh and Freeman’s scheme to implement homomorphic signatures to the real world scenario under multiple signers setting for a message. They replace the original sampling algorithm SamplePre() by Gentry et al. with Wang an...
متن کاملLattice-based Strong Designate Verifier Signature and Its Applications
Motivated by the need to have secure strong designate verifier signatures (SDVS) even in the presence of quantum computers, a post-quantum lattice-based SDVS scheme is proposed based on the hardness of the short integer solution problem (SIS) and the learning with errors problem (LWE). The proposed SDVS scheme utilizes the Bonsai trees and pre-image sample-able function primitives to generate t...
متن کاملA Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model
In this work, we present a generic framework for constructing efficient signature schemes, ring signature schemes, and identity based encryption schemes, all in the standard model (without relying on random oracles). We start by abstracting the recent work of Hohenberger and Waters (Crypto 2009), and specifically their “prefix method”. We show a transformation taking a signature scheme with a v...
متن کامل